Equal Bits: Enforcing Equally Distributed Binary Network Weights

نویسندگان

چکیده

Binary networks are extremely efficient as they use only two symbols to define the network: {+1, −1}. One can make prior distribution of these a design choice. The recent IR-Net Qin et al. argues that imposing Bernoulli with equal priors (equal bit ratios) over binary weights leads maximum entropy and thus minimizes information loss. However, work cannot precisely control weight during training, therefore guarantee entropy. Here, we show quantizing using optimal transport any ratio, including ratios. We investigate experimentally ratios indeed preferable our method optimization benefits. quantization is effective when compared state-of-the-art binarization methods, even pruning. Our code available at https://github.com/liyunqianggyn/Equal-Bits-BNN.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equally Distributed Correspondences

The study of measurable and integrable selections from a correspondence (set-valued function) has been of interest for some time [e.g., see Aumann (1965), Hildenbrand (1974), etc.]. Here we take up the study of distributions of such selections. The motivation for doing this comes from Mathematical Economics [see Kannai (1970, section 7); the reader interested in the economic applications is ref...

متن کامل

Storage Capacity of a Multilayer Neural Network with Binary Weights

Statistical mechanics is applied to estimate the maximal capacity per weight (a3 of a two-layer feed-forward network with binary weights, functioning as a parity machine of the hidden units. For K 2 2 hidden units, the maximal theoretical capacity is achieved, a, = 1, and the average overlap between different solutions is zero. These results agree with the simulations. At finite temperature one...

متن کامل

Equal Gain Combiner Performance in Equally-Correlated Rayleigh Fading Channels

Absimct--This paper develops a novel approach for performance analysis of multi-branch pre-detection equal gain mmbining (EGO in equally-correlated Rayleigb fading channels. We convert a set of equally-correlated channel gains to a set of conditionally independent channel gains. The cumulative dimibntion innclion ( c m of EGC ontpnt signal-to.noise ratio (SNR) is therefore derived. The symbol e...

متن کامل

Enforcing Point-wise Priors on Binary Segmentation

Non-negative point-wise priors such as saliency map, defocus field, foreground mask, object location window, and user given seeds, appear in many fundamental computer vision problems. These priors come in the form of confidence or probability values, and they are often incomplete, irregular, and noisy, which eventually makes the labelling task a challenge. Our goal is to extract image regions t...

متن کامل

When Not All Bits Are Equal: Worth-Based Information Flow

Only recently have approaches to quantitative information flow started to challenge the presumption that all leaks involving a given number of bits are equally harmful. This paper proposes a framework to capture the semantics of information, making quantification of leakage independent of the syntactic representation of secrets. Secrets are defined in terms of fields, which are combined to form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2022

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v36i2.20039